/*
 * Copyright (c) 2010, artur
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the name of the author nor the names of any co-contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

/*
 * kiddie-os
 * Created on: 14.04.2010
 *     Author: artur
 *
 */

#ifndef BTREE_H_
#define BTREE_H_

namespace util
{

	template<typename T>
	class TreeNode
	{

		public:

			TreeNode(const T& val) :
				val_(val), left_(NULL), right_(NULL)
			{
			}

			~TreeNode()
			{
				delete left_;
				delete right_;
			}

			const T& getVal() const
			{
				return (val_);
			}

			void setVal(const T& val)
			{
				val_ = val;
			}

			void addChild(TreeNode<T>* p)
			{
				const T& other = p->getVal();
				if (other > val_)
					if (right_)
						right_->addChild(p);
					else
						right_ = p;
				else if (left_)
					left_->addChild(p);
				else
					left_ = p;
			}

			const TreeNode<T>* getLeft()
			{
				return (left_);
			}

			const TreeNode<T>* getRight()
			{
				return (right_);
			}

		private:
			T val_;
			TreeNode<T>* left_;
			TreeNode<T>* right_;

	};

}

#endif /* BTREE_H_ */
